A low complexity puncturing method for low-rate polar codes

ABSTRACT

Features of the present disclosure implement a low complexity rate-matching design for polar codes that supports full rate-matching granularity, in some cases without good bit re-estimation after puncturing. In particular, features of the present disclosure provide techniques for adjusting the information bits allocation based on the number of punctured bits (P) for block puncturing polar codes. Particularly, features of the present disclosure determine the number of information bits for each sector based on a capacity formula after the puncturing.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims benefit of International Application No.PCT/CN2017/073034 entitled “A LOW COMPLEXITY PUNCTURING METHOD FORLOW-RATE POLAR CODES” and filed Feb. 7, 2017, which is expresslyincorporated by reference herein in its entirety.

BACKGROUND

Aspects of the present disclosure relate generally to wirelesscommunication networks, and more particularly, to polarization code ratematching.

Wireless communication networks are widely deployed to provide varioustypes of communication content such as voice, video, packet data,messaging, broadcast, and so on. These systems may be multiple-accesssystems capable of supporting communication with multiple users bysharing the available system resources (e.g., time, frequency, andpower). Examples of such multiple-access systems include code-divisionmultiple access (CDMA) systems, time-division multiple access (TDMA)systems, frequency-division multiple access (FDMA) systems, orthogonalfrequency-division multiple access (OFDMA) systems, and single-carrierfrequency division multiple access (SC-FDMA) systems.

These multiple access technologies have been adopted in varioustelecommunication standards to provide a common protocol that enablesdifferent wireless devices to communicate on a municipal, national,regional, and even global level. For example, a fifth generation (5G)wireless communications technology (which can be referred to as newradio (NR)) is envisaged to expand and support diverse usage scenariosand applications with respect to current mobile network generations. Inan aspect, 5G communications technology can include: enhanced mobilebroadband addressing human-centric use cases for access to multimediacontent, services and data; ultra-reliable-low latency communications(URLLC) with certain specifications for latency and reliability; andmassive machine type communications, which can allow a very large numberof connected devices and transmission of a relatively low volume ofnon-delay-sensitive information. As the demand for mobile broadbandaccess continues to increase, however, further improvements in NRcommunications technology and beyond may be desired.

One such need for improvement may relate to the reliability of datatransmissions to ensure high quality of communication. Generally, tothat end, a source encoder of the transmitting device (e.g., basestation or user equipment (UE)) may typically compress the data to betransmitted over a communication channel, while a channel encoder mayadd further redundancy to the compressed data in order to protect thedata against noise in the transmission channel. In turn, a receiver(e.g., base station or UE) may receive the encoded data and use achannel decoder to perform the inverse of channel encoding.

Channel encoding generally includes converting a transport block (e.g.,data sought for transmission) into a codeword. A codeword includes errorprotection bits in order to make it suitable for transmission over thewireless channel. Conventional techniques achieve the above goals byemploying a linear block encoder that multiplies a transport block usinga matrix. One example of a linear block encoder is a technique utilizingpolar codes. A polar code is a linear block error correcting code. Thecode construction is based on a multiple recursive concatenation of ashort kernel codes which transforms the physical channel into multiplevirtual channels. However, when the number of recursions becomes large,the virtual channels tend to either have high reliability or lowreliability (in other words, they polarize), and thus the data bits areallocated to the most reliable channels.

Typically, the codeword length of conventional polar codes must be apower of two. Because puncturing is required to support arbitrary codelength, code bit puncturing may change the polarization structure andrequire good bit re-estimation after puncturing. In coding theory,“puncturing” is the process of removing some of the parity bits afterencoding with an error-correction code. A Gaussian approximation schemeof complexity O(N·log 2(N)) for good bit re-estimation is used with thesignal to noise ratio (SNR) assumptions for different code rates that isknown by both transmitter and receiver. However, such channelre-estimation procedures are generally resource intensive and add delayto the transmission of the codewords. Thus, further improvements inwireless communication operations may be desired.

SUMMARY

The following presents a simplified summary of one or more aspects inorder to provide a basic understanding of such aspects. This summary isnot an extensive overview of all contemplated aspects, and is intendedto neither identify key or critical elements of all aspects nordelineate the scope of any or all aspects. Its sole purpose is topresent some concepts of one or more aspects in a simplified form as aprelude to the more detailed description that is presented later.

Aspects of the present disclosure disclose techniques solve theabove-identified problems by implementing a low complexity rate-matchingdesign for polar code that supports full rate-matching granularity, insome cases without good bit re-estimation after puncturing. Inparticular, features of the present disclosure provide techniques foradjusting the information bits allocation based on the number ofpunctured bits (P) for the block puncturing polar codes. For example,features of the present disclosure determine the number of informationbits for each sector (e.g., K0, K1, K3, and K4) based on capacity afterthe puncturing. Thus, the features of the present disclosure provide anadvantage of shorter delay compared to the conventional techniques.Particularly, the decoding complexity and delay of the proposedpuncturing polar code may be a function of the size M₁ instead ofN=2^(n) of conventional systems since the first N−M₁ bit channels areset to frozen bits.

In one example, a method for rate matching codes polarization ofwireless communications is disclosed. The method may include determininga number of punctured bits for a block puncturing polar codes, adjustingallocation of information bits based on the number of punctured bits,and generating a codeword for transmission over a wireless channel basedon the allocation of the information bits.

In another example, an apparatus for rate matching codes polarization ofwireless communications is disclosed. The apparatus may include a memoryconfigured to store instructions and a processor communicatively coupledwith the memory. The processor may be configured to execute theinstructions to determine a number of punctured bits for blockpuncturing polar codes. The instructions may further be configured toadjust allocation of information bits based on the number of puncturedbits, and generate a codeword for transmission over a wireless channelbased on the allocation of the information bits.

In another example, a computer readable medium for rate matching codespolarization of wireless communications is disclosed. The computerreadable medium may include code for determining a number of puncturedbits for a block puncturing polar codes, adjusting allocation ofinformation bits based on the number of punctured bits, and generating acodeword for transmission over a wireless channel based on theallocation of the information bits.

In another example, another apparatus for rate matching codespolarization of wireless communications is disclosed. The apparatus mayinclude means for determining a number of punctured bits for a blockpuncturing polar codes, adjusting allocation of information bits basedon the number of punctured bits, and generating a codeword fortransmission over a wireless channel based on the allocation of theinformation bits.

To the accomplishment of the foregoing and related ends, the one or moreaspects comprise the features hereinafter fully described andparticularly pointed out in the claims. The following description andthe annexed drawings set forth in detail certain illustrative featuresof the one or more aspects. These features are indicative, however, ofbut a few of the various ways in which the principles of various aspectsmay be employed, and this description is intended to include all suchaspects and their equivalents.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosed aspects will hereinafter be described in conjunction withthe appended drawings, provided to illustrate and not to limit thedisclosed aspects, wherein like designations denote like elements, andin which:

FIG. 1 is a schematic diagram of an example wireless communicationssystem having a channel polarization component to adjust allocation ofone or more information bits based on the number of punctured bits forblock puncturing polar codes in accordance with aspects of the presentdisclosure;

FIG. 2 is a block diagram of an example of a channel polarizationprocessing architecture in accordance with aspects of the presentdisclosure;

FIG. 3 is a block diagram of an example of a bit structure as input intoan encoder based on bit reversal puncturing in accordance with aspectsof the present disclosure;

FIG. 4 is a schematic diagram of an example a bit index structurerelated to an example of adjusting the information bits allocation basedon the number of punctured bits for the block puncturing polar codes inaccordance with aspects of the present disclosure;

FIG. 5 is an example processing architecture diagram of an exampleprocess for allocating information bits using a capacity formula inaccordance with aspects of the present disclosure;

FIG. 6 is a block diagram of an example of a resulting bit structure tobe input into an encoder after execution of a method of allocating theinformation bits using a predetermined bit order in accordance withaspects of the present disclosure;

FIG. 7 is a block diagram of an example subframe structure resultingfrom execution of an aspect of a hybrid repetition and puncturing methodin accordance with aspects of the present disclosure;

FIG. 8 is a schematic diagram of an aspect of an implementation ofvarious components of a transmitting device (e.g., base station or a UE)in accordance with various aspects of the present disclosure; and

FIG. 9 is a flowchart of an example method implemented by the UE forrate matching codes polarization of wireless communications inaccordance with aspects of the present disclosure.

DETAILED DESCRIPTION

As discussed above, code bit puncturing may change the polarizationstructure and require channel re-estimation after performing thepuncturing. However, the channel re-estimation procedure may be resourceintensive and add delay to the transmission of the codewords. Somemethods of baseline rate-matching of polar codes include applying aquasi-uniform puncturing (QUP) method. The QUP method constructs a polarcode by calculating the reliability of each synthesized sub-channel as areliable metric using Density Evolution based on a Gaussianapproximation (DE/GA). The sub-channels with high reliability are chosento transmit the information bits, while the bits for the unreliablesub-channels are set to zero, referred to or called frozen bits. Thisset of unreliable positions is called the frozen-set (F). Given acombination of code rate (R) and code length (M), both encoder anddecoder have to compute this frozen-set (F) before encoding or decoding.The uniqueness of the frozen set (F) between encoder and decoder shouldbe secured.

Due to the fact that a polar code with a mother code length N that is apower of two can be regarded as a nested combination of two polar codesof length N/2, such a method constructs an ordered sequence of bitpositions (index sequence) such that the ordered sequence for the polarcodes of length N/2 is a subset of the ordered sequence for the polarcodes of length N. This method, referred to as “bit reversal puncturing”relies on selecting the first K good bits according to a predeterminedgood bit order and skipping the frozen bits before allocating the K databits. A good-bit-order list is a sequence of input bit indices where theorder indicates the possibility to be selected as a good bit (See FIG.3). Because of the nested property, a single good-bit-order list oflargest N of interest is needed to be stored. However, one concern withthe bit-reversal puncturing channel is the decoding latency for controlchannels with a large number of blind decoding. This is, because thedecoding complexity and delay of the punctured polar code is a functionof size N=2^(n), but not the codeword size M.

Another technique, referred to as block puncturing, has also beenproposed for polar codes. In this technique, in order to attain anytarget codeword length M, the scheme simply removes (i.e. does nottransmit) the first P=2^(┌log) ² ^((M)┐)−M consecutive coded bits andsets the first P bit-channels to frozen bits due to zero capacity bypuncturing. However, this block puncturing scheme has seriousperformance loss compared to the bit-reversal puncturing when thepuncturing is heavy (e.g., the number of punctured bits (P) is close toN/2 where N=2^(┌log) ² ^((M)┐). This is because the block puncturing maychange the polarization structure and the determination of theinformation set by skipping good bit indices. That is, if the upper partof the coded bits (e.g., channel after XOR) is punctured, then the lowerpart (e.g., channel after repetition) may see a channel of W instead ofW+ since some bits may not be repeated. Therefore, the K information bitallocation derived from the bit-order sequence based on fullpolarization may not be optimistic.

Aspects of the present disclosure address the above-identified problemby adjusting the information bits allocation based on the number ofpunctured bits (P) for the block puncturing polar codes. Particularly,features of the present disclosure determine the number of informationbits for each sector (e.g., K0, K1, K3, and K4) (See FIG. 4) based oncapacity formula after the puncturing. For low rate polar codes (e.g.,R=K/M≤⅓), the block puncturing may be applied to the upper part of thecoded bits (e.g., channel after XOR) which is then divided into foursectors (or more for finer granularity). If there is any punctured bitin the sector, then no information bits are allocated to that sector.Additionally, frozen bit positions (or other K_(i) values) may beselected by using the Gaussian approximation (e.g. for M=m*2^(n), m=1,3, 5 and 7) or according to a predetermined good bit order and skippingthe frozen bits before allocating K info bits. The solution of thepresent disclosure may have one or more advantages, including reduceddecoding latency because the decoding complexity and delay of theproposed puncturing polar code is a function of the size M₁ instead ofN=2^(n) since the first N−M₁ bit channels are set to frozen bits.

Various aspects are now described with reference to the drawings. In thefollowing description, for purposes of explanation, numerous specificdetails are set forth in order to provide a thorough understanding ofone or more aspects. It may be evident, however, that such aspect(s) maybe practiced without these specific details. Additionally, the term“component” as used herein may be one of the parts that make up asystem, may be hardware, firmware, and/or software stored on acomputer-readable medium, and may be divided into other components.

The following description provides examples, and is not limiting of thescope, applicability, or examples set forth in the claims. Changes maybe made in the function and arrangement of elements discussed withoutdeparting from the scope of the disclosure. Various examples may omit,substitute, or add various procedures or components as appropriate. Forinstance, the methods described may be performed in an order differentfrom that described, and various steps may be added, omitted, orcombined. Also, features described with respect to some examples may becombined in other examples.

Referring to FIG. 1, in accordance with various aspects of the presentdisclosure, an example wireless communication network 100 may includeone or more base stations 105, one or more UEs 115, and a core network130. The core network 130 may provide user authentication, accessauthorization, tracking, internet protocol (IP) connectivity, and otheraccess, routing, or mobility functions. The base stations 105 mayinterface with the core network 130 through backhaul links 134 (e.g.,S1, etc.). The base stations 105 may perform radio configuration andscheduling for communication with the UEs 115, or may operate under thecontrol of a base station controller (not shown). In various examples,the base stations 105 may communicate, either directly or indirectly(e.g., through core network 130), with one another over backhaul links134 (e.g., X1, etc.), which may be wired or wireless communicationlinks. In some examples, the base station 105 and the UE 115, operatingas the transmitting device, may include a channel polarization component850 (see FIG. 8) configured to perform channel polarization by adjustingallocation of one or more information bits based on the number ofpunctured bits for block puncturing polar codes, as described in moredetail below.

The base stations 105 may wirelessly communicate with the UEs 115 viaone or more base station antennas. Each of the base stations 105 mayprovide communication coverage for a respective geographic coverage area110. In some examples, base stations 105 may be referred to as a basetransceiver station, a radio base station, an access point, a radiotransceiver, a NodeB, eNodeB (eNB), Home NodeB, a Home eNodeB, gNodeB,gNB, a relay, or some other suitable terminology. The geographiccoverage area 110 for a base station 105 may be divided into sectors orcells making up only a portion of the coverage area (not shown). Thewireless communication network 100 may include base stations 105 ofdifferent types (e.g., macro base stations or small cell base stations,described below). Additionally, the plurality of base stations 105 mayoperate according to different ones of a plurality of communicationtechnologies (e.g., 5G, 4G/LTE, 3G, Wi-Fi, Bluetooth, etc.), and thusthere may be overlapping geographic coverage areas 110 for differentcommunication technologies.

In some examples, the wireless communication network 100 may be orinclude a Long Term Evolution (LTE) or LTE-Advanced (LTE-A) technologynetwork. The wireless communication network 100 may also be a nextgeneration technology network, such as a 5G wireless communicationnetwork. In LTE/LTE-A networks, the term evolved node B (eNB) or gNB maybe generally used to describe the base stations 105, while the term UEmay be generally used to describe the UEs 115. The wirelesscommunication network 100 may be a heterogeneous LTE/LTE-A network inwhich different types of eNBs provide coverage for various geographicalregions. For example, each eNB or base station 105 may providecommunication coverage for a macro cell, a small cell, or other types ofcell. The term “cell” is a 3GPP term that can be used to describe a basestation, a carrier or component carrier associated with a base station,or a coverage area (e.g., sector, etc.) of a carrier or base station,depending on context.

A macro cell may generally cover a relatively large geographic area(e.g., several kilometers in radius) and may allow unrestricted accessby the UEs 115 with service subscriptions with the network provider.

A small cell may include a relative lower transmit-powered base station,as compared with a macro cell, that may operate in the same or differentfrequency bands (e.g., licensed, unlicensed, etc.) as macro cells. Smallcells may include pico cells, femto cells, and micro cells according tovarious examples. A pico cell, for example, may cover a small geographicarea and may allow unrestricted access by the UEs 115 with servicesubscriptions with the network provider. A femto cell may also cover asmall geographic area (e.g., a home) and may provide restricted accessand/or unrestricted access by the UEs 115 having an association with thefemto cell (e.g., in the restricted access case, the UEs 115 in a closedsubscriber group (CSG) of the base station 105, which may include theUEs 115 for users in the home, and the like). An eNB for a macro cellmay be referred to as a macro eNB. An eNB for a small cell may bereferred to as a small cell eNB, a pico eNB, a femto eNB, or a home eNB.An eNB may support one or multiple (e.g., two, three, four, and thelike) cells (e.g., component carriers).

The communication networks that may accommodate some of the variousdisclosed examples may be packet-based networks that operate accordingto a layered protocol stack and data in the user plane may be based onthe IP. A radio link control (RLC) layer may perform packet segmentationand reassembly to communicate over logical channels. A MAC layer mayperform priority handling and multiplexing of logical channels intotransport channels. The MAC layer may also use HARQ to provideretransmission at the MAC layer to improve link efficiency. In thecontrol plane, the radio resource control (RRC) protocol layer mayprovide establishment, configuration, and maintenance of an RRCconnection between a UE 115 and the base stations 105. The RRC protocollayer may also be used for core network 130 support of radio bearers forthe user plane data. At the physical (PHY) layer, the transport channelsmay be mapped to physical channels.

The UEs 115 may be dispersed throughout the wireless communicationnetwork 100, and each UE 115 may be stationary or mobile. A UE 115 mayalso include or be referred to by those skilled in the art as a mobilestation, a subscriber station, a mobile unit, a subscriber unit, awireless unit, a remote unit, a mobile device, a wireless device, awireless communications device, a remote device, a mobile subscriberstation, an access terminal, a mobile terminal, a wireless terminal, aremote terminal, a handset, a user agent, a mobile client, a client, orsome other suitable terminology. A UE 115 may be a cellular phone, apersonal digital assistant (PDA), a wireless modem, a wirelesscommunication device, a handheld device, a tablet computer, a laptopcomputer, a cordless phone, a wireless local loop (WLL) station, anentertainment device, a vehicular component, or any device capable ofcommunicating in wireless communication network 100. Additionally, a UE115 may be Internet of Things (IoT) and/or machine-to-machine (M2M) typeof device, e.g., a low power, low data rate (relative to a wirelessphone, for example) type of device, that may in some aspects communicateinfrequently with wireless communication network 100 or other UEs. A UE115 may be able to communicate with various types of base stations 105and network equipment including macro eNBs, small cell eNBs, relay basestations, and the like.

A UE 115 may be configured to establish one or more wirelesscommunication links 125 with one or more base stations 105. The wirelesscommunication links 125 shown in wireless communication network 100 maycarry UL transmissions from a UE 115 to a base station 105, or downlink(DL) transmissions, from a base station 105 to a UE 115. The downlinktransmissions may also be called forward link transmissions while theuplink transmissions may also be called reverse link transmissions. Eachwireless communication link 125 may include one or more carriers, whereeach carrier may be a signal made up of multiple sub-carriers (e.g.,waveform signals of different frequencies) modulated according to thevarious radio technologies described above. Each modulated signal may besent on a different sub-carrier and may carry control information (e.g.,reference signals, control channels, etc.), overhead information, userdata, etc. In an aspect, the communication links 125 may transmitbidirectional communications using frequency division duplex (FDD)(e.g., using paired spectrum resources) or time division duplex (TDD)operation (e.g., using unpaired spectrum resources). Frame structuresmay be defined for FDD (e.g., frame structure type 1) and TDD (e.g.,frame structure type 2). Moreover, in some aspects, the communicationlinks 125 may represent one or more broadcast channels.

In the wireless communication network 100, the one or more UEs 115 mayeither be in a radio resource control (RRC) connected mode or RRC idlemode. During the RRC connected mode, the UEs 115 may maintain anestablished communication with the base station 105. During the RRC idlemode, the UEs 115 may be in sleep mode without any communication withthe base station 105. The sleep mode, for example, may afford the UEs115 an opportunity to conserve battery power.

In some aspects of the wireless communication network 100, base stations105 or UEs 115 may include multiple antennas for employing antennadiversity schemes to improve communication quality and reliabilitybetween base stations 105 and UEs 115. Additionally or alternatively,base stations 105 or UEs 115 may employ multiple input multiple output(MIMO) techniques that may take advantage of multi-path environments totransmit multiple spatial layers carrying the same or different codeddata.

In situations when the UEs 115 are in RRC idle mode, the base station105 may use a paging process to initiate access the UE 115. The term“paging process” or “paging message” may refer to any control messagetransmitted by the base station 105 to alert the UE 115 of an existenceof a page. Thus, the one or more UEs 115 in RRC idle mode may awake onlyperiodically to listen for paging messages. Because the UEs 115 in theRRC idle mode may only awake periodically, it may be challenging for thebase stations 105 to effectively utilize beamforming to direct a pagetowards a particular UE 115. Specifically, because the base station maynot be aware of the exact location or cell in which the UE 115 may awaketo listen for the paging message, the base station 105 generallytransmits over multiple directions (referred to as a transmission sweep)in order to ensure that the idle mode UE receives the paging message.However, as discussed above, such transmission sweeps are resourceintensive.

The wireless communication network 100 may support operation on multiplecells or carriers, a feature which may be referred to as carrieraggregation (CA) or multi-carrier operation. A carrier may also bereferred to as a component carrier (CC), a layer, a channel, etc. Theterms “carrier,” “component carrier,” “cell,” and “channel” may be usedinterchangeably herein. A UE 115 may be configured with multipledownlink CCs and one or more uplink CCs for carrier aggregation. Carrieraggregation may be used with both FDD and TDD component carriers.

Referring now to FIG. 2, an example channel polarization processingarchitecture 200 for two-input is described. As discussed above, thepolar code construction is based on a multiple recursive concatenationof a short kernel code which transforms the physical channel 205 intomultiple virtual outer channels 210 (e.g., W− bad channel 210-a and W+good channel 210-b). The terms “bad channel” and “good channel” mayrefer to the channel quality based on the signal-to-noise (SNR) ratioand/or reliability for each channel. For example, if a channel has a lowSNR ratio, it may be considered a “bad channel,” while a high SNR ratiomay be associated with “good channel.” When the number of recursionsbecomes large, the virtual channels tend to either have high reliabilityor low reliability (in other words, they polarize), and the data bitsare allocated to the most reliable channels. In the illustrated example,a pair of identical binary-input channels 205 are transformed into twodistinct channels 210 of different qualities, e.g., one better and oneworse than the original binary-input channel 205. In such instance,channel W− 210-a (e.g., “bad channel”) may include input u₀ and outputsy₀ and y₁. Similarly, the channel W+ 210-b (e.g., “good channel”) mayinclude input u₁ and outputs y₀ and y₁. The channel polarization for thetwo channels 210 may be achieved as follow, where channel W− 210-a hasinput U₀ and output y₀, and channel W+ has input U₁ and output y₁:

U ₀ =X ₀ ⊕X ₁ =Y ₀ ⊕Y ₁ parity-check

Erasure probability, ε⁻=1−(1−ε)²=2ε−ε².

U ₁ =X ₁ =X ₀ ⊕U ₀ repetition,

Erasure probability, ε⁺=ε².

In some examples, the above operation can be performed recursively wherea set of N=2^(n) “bit-channels” of varying qualities can be obtained.For instance, the operation can include the transmission of the infobits over a “good” channel, and the transmission of the known “frozen”bits over the “bad” channel. Optionally, CRC can be added to theinfo-block to aid with list SC decoding.

Referring to FIG. 3, one solution that includes a bit structureresulting from a bit reversal puncturing technique 300 is disclosed. Thebit reversal puncturing technique 300 relies on selecting the first Kgood bits 305 according to a predetermined good bit order and skippingthe frozen bits 310 before allocating the K data bits 315. Particularly,the method applies the quasi-uniform puncturing pattern and sets thecorresponding input bits as frozen bits 325. In other words, thelocations of the punctured bits 320 and those of the bit-channels withzero capacity are determined by bit-reversing the descending-orderedbinary indices [0, 1, . . . , N−2, N−1] and marking the N-M indices withhighest bit-reversed value as punctured positions, e.g., P=[BitRev(M), .. . , BitRev(N−2), BitRev(N−1)] where M is the code length afterpuncturing.

However, the concern with the bit reversal puncturing technique 300 isthe decoding latency. This is especially true for control channels withlarge number of blind decoding. This is because the decoding complexityand delay of this punctured polar code is a function of size N=2^(n) butnot the codeword size M.

Another solution (not shown) relates to block puncturing withoutinformation set optimization. In this alternative solution, a simplepuncturing scheme was proposed for polar codes. To attain any targetcodeword length M, the scheme simply removes the firstP=2^(┌log 2(M)┐)−M consecutive coded bits and sets the first Pbit-channels to frozen bits due to zero capacity by puncturing. However,this scheme has serious performance loss compared to the bit-reversalpuncturing when the puncturing is heavy, e.g., the number of puncturedbits P is closed to N/2 where N=2^(┌log2(M)┐). This is because the blockpuncturing will change the polarization structure and the determinationof the info set by skipping good bit indices on the punctured bits isnot sufficient. That is, if the upper part of the coded bits (channelafter XOR) is punctured then the lower part (channel after repetition)will see a channel of W instead of W+ since some bits are not repeated.Therefore, the K info bits allocation derived from the bit-ordersequence based on full polarization will be too optimistic.

Referring to FIG. 4, a diagram 400 illustrates a solution in accordanceto the present disclosure that adjusts the allocation of the informationbits based on the number of punctured bits for the block puncturingpolar codes. For example, the allocation of the information bits may beidentified by determining the number of information bits in each sector405 (of n K info bits, or Kn, e.g. K0 405-a, K1 405-b, K2 405-c, K3405-d, and K4 405-e), where K=K0+K1+K2+K3+K4 based on capacity after thepuncturing. For low rate polar codes, e.g., R=(K/M)≤⅓, the blockpuncturing may be applied to the upper part of the coded bits, which isthen divided into four sectors 405 (or finer granularity). If there isany punctured bit in the sector 405, then no information bit isallocated to that sector, e.g., K_(i)=0, setting as the frozen bits.Then, other frozen positions (or other K_(i) values) are selected byusing the Gaussian approximation (for M=m*2^(n), m=1, 3, 5 and 7) oraccording to a predetermined good bit order and skipping the frozen bitsbefore allocating K info bits.

For example:

0<N−M≤(N/8):K ₀=0,M ₁=(7N/8)<M;

0<N−M≤(N/4):K ₀ =K ₁=0,M ₁=(3N/4)<M;

0<N−M≤(3N/8):K ₀ =K ₁ =K ₂=0,M ₁=(5N/8)<M; and

0<N−M<(N/2):K ₀ =K ₁ =K ₂ =K ₃=0,M ₁=(N/2)<M.

Referring to FIG. 5 includes an example processing architecture 500 forallocating information bits using a capacity formula in accordance withaspects of the present disclosure. The architecture 500 includes aphysical channel 505 that is represented by a plurality of virtualchannels. The channels may be subdivided into different sectors 510.

In accordance with aspects of the present disclosure, the allocation ofthe information bits is adjusted based on the number of punctured bits(P) for the block puncturing polar codes. Particularly, features of thepresent disclosure determine the number of information bits for eachsector 510 based on channel capacity after the puncturing. The capacityof each sector, e.g., R1, R2 and R3 can be derived from mutualinformation transfer chart using the information rate R=K/M as the input(Note: R1+R2+R3=3*R). Additionally, in some examples, the informationbit distribution can be derived as: K1=R1*(N/3), K2=R1*(N/3),K3=R3*(N/3).

For low rate polar codes (e.g., R=K/M≤⅓), the block puncturing may beapplied to the upper part of the channel (e.g., channel after XOR) whichis then further subdivided into multiple sectors 510 (or more for finergranularity). If there is any punctured bit in the sector, then noinformation bits are allocated to that sector. Additionally, frozen bitpositions (or other K_(i) values) may be selected by using the Gaussianapproximation (e.g. for M=m*2^(n), m=1, 3, 5 and 7) or according to apredetermined good bit order and skipping the frozen bits beforeallocating K info bits.

Referring to FIG. 6, a diagram 600 illustrates a bit order structure asinputted into an encoder in accordance with a method of determininginformation bit allocation using a predetermined good bit order. In someexamples, the first N−M₁ sub-channels 605 may be set to frozen bits andthe remaining M₁ sub-channels 610 may be sorted based on the ascendingreliability. Thereafter, the K information sub-channels 615 may beselected from the rightmost to the leftmost reliability while skippingthe frozen sub-channels 610. Further, compared to the block puncturingwithout info set optimization, additional M₁−M sub-channels may be setto frozen irrespective of reliability order.

Thus, in some examples, the number of untransmitted bits are P=N−M whereN is the mother code block length of power of 2 and M is the codelength. In some examples, instead of freezing all input bits with index0<=u<=(N−M) as shown in FIG. 3, features of the present disclosureinclude techniques to freeze input bits with index 0<=u<(N−M1) whereM1>M. The location for information bits are then determined from theremaining N−M1 bit location. As such, features of the present disclosuremay freeze input bits corresponding to untransmitted coded bits and alsofreeze additional bits (e.g., M1−M) for puncturing.

Referring to FIG. 7, in an alternative, an example aspect of hybridrepetition and puncturing frame structure 700 is illustrated. In thiscase, the M coded bits can be obtained by using a hybrid repetition andpuncturing, e.g., repetition is used on top of polar code of size M1where M1 is selected from 7N/8, 3N/4, 5N/8 and N/2 and N is a power of 2larger than M, e.g., N=2^(┌log2(M)┐). Further, the block puncturingwithout info set optimization is used to obtain the M1 coded bits, e.g.,selecting K good bits by skipping good bit indices on the puncturedbits.

The solution of the present disclosure may have one or more advantages.The decoding complexity and delay of the proposed puncturing polar codeis a function of the size M₁ instead of N=2^(n) since the first N−M₁ bitchannels are set to frozen bits.

FIG. 8 is an example of hardware components and subcomponents of atransmitting device that may be a UE 115 or a base station 105 forimplementing one or more methods (e.g., method 900) described herein inaccordance with various aspects of the present disclosure. For example,one example of an implementation of the transmitting device may includea variety of components, some of which have already been describedabove, but including components such as one or more processors 812 andmemory 816 and transceiver 802 in communication via one or more buses844, which may operate in conjunction with the channel polarizationcomponent 850.

The channel polarization component 850 may implement techniquesdescribed herein for rate matching codes polarization of wirelesscommunications. In some examples, the channel polarization component 850may determine a number of punctured bits for block puncturing polarcodes. The channel polarization component 850 may also include aninformation bit allocation component 855 for adjusting allocation ofinformation bits based on the number of punctured bits. The channelpolarization component 850 may further include a codeword generationcomponent 860 for generating a codeword for transmission over a wirelesschannel based on the allocation of the information bits.

The one or more processors 812, modem 814, memory 816, transceiver 802,RF front end 888 and one or more antennas 865, may be configured tosupport voice and/or data calls (simultaneously or non-simultaneously)in one or more radio access technologies. In an aspect, the one or moreprocessors 812 can include a modem 814 that uses one or more modemprocessors. The various functions related to communication managementcomponent 850 may be included in modem 814 and/or processors 812 and, inan aspect, can be executed by a single processor, while in otheraspects, different ones of the functions may be executed by acombination of two or more different processors. For example, in anaspect, the one or more processors 812 may include any one or anycombination of a modem processor, or a baseband processor, or a digitalsignal processor, or a transmit processor, or a receiver processor, or atransceiver processor associated with transceiver 802. In other aspects,some of the features of the one or more processors 812 and/or modem 814associated with communication management component 850 may be performedby transceiver 802.

Also, memory 816 may be configured to store data used herein and/orlocal versions of applications or communication management component 850and/or one or more of its subcomponents being executed by at least oneprocessor 812. Memory 816 can include any type of computer-readablemedium usable by a computer or at least one processor 812, such asrandom access memory (RAM), read only memory (ROM), tapes, magneticdiscs, optical discs, volatile memory, non-volatile memory, and anycombination thereof. In an aspect, for example, memory 816 may be anon-transitory computer-readable storage medium that stores one or morecomputer-executable codes defining communication management component850 and/or one or more of its subcomponents, and/or data associatedtherewith, when UE 115 is operating at least one processor 812 toexecute communication management component 850 and/or one or more of itssubcomponents.

Transceiver 802 may include at least one receiver 806 and at least onetransmitter 808. Receiver 806 may include hardware, firmware, and/orsoftware code executable by a processor for receiving data, the codecomprising instructions and being stored in a memory (e.g.,computer-readable medium). Receiver 806 may be, for example, a radiofrequency (RF) receiver. In an aspect, receiver 806 may receive signalstransmitted by at least one UE 115. Additionally, receiver 806 mayprocess such received signals, and also may obtain measurements of thesignals, such as, but not limited to, Ec/Io, SNR, RSRP, RSSI, etc.Transmitter 808 may include hardware, firmware, and/or software codeexecutable by a processor for transmitting data, the code comprisinginstructions and being stored in a memory (e.g., computer-readablemedium). A suitable example of transmitter 808 may including, but is notlimited to, an RF transmitter.

Moreover, in an aspect, transmitting device may include RF front end888, which may operate in communication with one or more antennas 865and transceiver 802 for receiving and transmitting radio transmissions,for example, wireless communications transmitted by at least one basestation 105 or wireless transmissions transmitted by UE 115. RF frontend 888 may be connected to one or more antennas 865 and can include oneor more low-noise amplifiers (LNAs) 890, one or more switches 892, oneor more power amplifiers (PAs) 898, and one or more filters 896 fortransmitting and receiving RF signals.

In an aspect, LNA 890 can amplify a received signal at a desired outputlevel. In an aspect, each LNA 890 may have a specified minimum andmaximum gain values. In an aspect, RF front end 888 may use one or moreswitches 892 to select a particular LNA 390 and its specified gain valuebased on a desired gain value for a particular application.

Further, for example, one or more PA(s) 898 may be used by RF front end588 to amplify a signal for an RF output at a desired output powerlevel. In an aspect, each PA 898 may have specified minimum and maximumgain values. In an aspect, RF front end 888 may use one or more switches892 to select a particular PA 898 and its specified gain value based ona desired gain value for a particular application.

Also, for example, one or more filters 896 can be used by RF front end888 to filter a received signal to obtain an input RF signal. Similarly,in an aspect, for example, a respective filter 896 can be used to filteran output from a respective PA 898 to produce an output signal fortransmission. In an aspect, each filter 896 can be connected to aspecific LNA 890 and/or PA 898. In an aspect, RF front end 888 can useone or more switches 892 to select a transmit or receive path using aspecified filter 896, LNA 890, and/or PA 898, based on a configurationas specified by transceiver 802 and/or processor 812.

As such, transceiver 802 may be configured to transmit and receivewireless signals through one or more antennas 865 via RF front end 888.In an aspect, transceiver may be tuned to operate at specifiedfrequencies such that transmitting device can communicate with, forexample, one or more base stations 105 or one or more cells associatedwith one or more base stations 105. In an aspect, for example, modem 814can configure transceiver 802 to operate at a specified frequency andpower level based on the configuration of the transmitting device andthe communication protocol used by modem 814.

In an aspect, modem 814 can be a multiband-multimode modem, which canprocess digital data and communicate with transceiver 802 such that thedigital data is sent and received using transceiver 802. In an aspect,modem 814 can be multiband and be configured to support multiplefrequency bands for a specific communications protocol. In an aspect,modem 814 can be multimode and be configured to support multipleoperating networks and communications protocols. In an aspect, modem 814can control one or more components of transmitting device (e.g., RFfront end 888, transceiver 802) to enable transmission and/or receptionof signals from the network based on a specified modem configuration. Inan aspect, the modem configuration can be based on the mode of the modemand the frequency band in use. In another aspect, the modemconfiguration can be based on UE configuration information associatedwith transmitting device as provided by the network during cellselection and/or cell reselection.

FIG. 9 is a flowchart of an example of a method 900 of wirelesscommunication implemented by either an base station or a UE, inaccordance with aspects of the present disclosure. Thus, the method 900may be performed using a device (e.g., base station 105 or UE 115)acting as a transmitting device. Although the method 900 is describedbelow with respect to the elements of base station 105 or UE 115, othercomponents may be used to implement one or more of the actions describedherein.

At block 905, the method 900 may include determining a number ofpunctured bits for a block puncturing polar codes. Aspects of 905 may beperformed by channel polarization components 850 described withreference to FIG. 8.

At block 910, the method 900 may include adjusting allocation ofinformation bits based on the number of punctured bits. In someexamples, the method may determine whether any punctured bits are in asector of a plurality of sectors of a channel. If the punctured bits areabsent from a sector (e.g., not in the sector), the method may allocatethe information bits in that sector. However, if one or more puncturedbits are in a sector, the method may instead allocate one or more frozenbits into that sector. Selecting a position for one or more frozen bitsmay include using the Gaussian approximation. The position for the oneor more frozen bits is selected such that a first sub-channel portion isset for the one or more frozen bits and a second sub-channel portion issorted based on ascending reliability. In some examples, the M codedbits may be obtained by using hybrid repetition and puncturing.Additionally or alternatively, features of the present disclosure mayfreeze input bits corresponding to untransmitted coded bits. Further,additional bits (M1−M in FIG. 6, where M1 is greater than M) may befrozen for puncturing for input bits with index 0<=u<(N−M1). Aspects of1010 be performed by information bit allocation component 855 describedwith reference to FIG. 8.

At block 915, the method 900 may optionally include applying blockpuncturing to an upper part of a coded bits for low rate polar codes. Insome examples, the method 900 may also include utilizing blockpuncturing without information set optimization to obtain a number ofcoded bits for codeword. Aspects of 905 may be performed by channelpolarization components 850 described with reference to FIG. 8.

At block 920, the method 900 may include generating a codeword fortransmission over a wireless channel based on the allocation of theinformation bits. Aspects of 920 be performed by codeword generationcomponent 860 described with reference to FIG. 8.

The above detailed description set forth above in connection with theappended drawings describes examples and does not represent the onlyexamples that may be implemented or that are within the scope of theclaims. The term “example,” when used in this description, means“serving as an example, instance, or illustration,” and not “preferred”or “advantageous over other examples.” The detailed description includesspecific details for the purpose of providing an understanding of thedescribed techniques. These techniques, however, may be practicedwithout these specific details. In some instances, well-known structuresand apparatuses are shown in block diagram form in order to avoidobscuring the concepts of the described examples.

Information and signals may be represented using any of a variety ofdifferent technologies and techniques. For example, data, instructions,commands, information, signals, bits, symbols, and chips that may bereferenced throughout the above description may be represented byvoltages, currents, electromagnetic waves, magnetic fields or particles,optical fields or particles, computer-executable code or instructionsstored on a computer-readable medium, or any combination thereof.

The various illustrative blocks and components described in connectionwith the disclosure herein may be implemented or performed with aspecially-programmed device, such as but not limited to a processor, adigital signal processor (DSP), an ASIC, a FPGA or other programmablelogic device, a discrete gate or transistor logic, a discrete hardwarecomponent, or any combination thereof designed to perform the functionsdescribed herein. A specially-programmed processor may be amicroprocessor, but in the alternative, the processor may be anyconventional processor, controller, microcontroller, or state machine. Aspecially-programmed processor may also be implemented as a combinationof computing devices, e.g., a combination of a DSP and a microprocessor,multiple microprocessors, one or more microprocessors in conjunctionwith a DSP core, or any other such configuration.

The functions described herein may be implemented in hardware, softwareexecuted by a processor, firmware, or any combination thereof. Ifimplemented in software executed by a processor, the functions may bestored on or transmitted over as one or more instructions or code on anon-transitory computer-readable medium. Other examples andimplementations are within the scope and spirit of the disclosure andappended claims. For example, due to the nature of software, functionsdescribed above can be implemented using software executed by aspecially programmed processor, hardware, firmware, hardwiring, orcombinations of any of these. Features implementing functions may alsobe physically located at various positions, including being distributedsuch that portions of functions are implemented at different physicallocations. Also, as used herein, including in the claims, “or” as usedin a list of items prefaced by “at least one of” indicates a disjunctivelist such that, for example, a list of “at least one of A, B, or C”means A or B or C or AB or AC or BC or ABC (i.e., A and B and C).

Computer-readable media includes both computer storage media andcommunication media including any medium that facilitates transfer of acomputer program from one place to another. A storage medium may be anyavailable medium that can be accessed by a general purpose or specialpurpose computer. By way of example, and not limitation,computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or otheroptical disk storage, magnetic disk storage or other magnetic storagedevices, or any other medium that can be used to carry or store desiredprogram code means in the form of instructions or data structures andthat can be accessed by a general-purpose or special-purpose computer,or a general-purpose or special-purpose processor. Also, any connectionis properly termed a computer-readable medium. For example, if thesoftware is transmitted from a website, server, or other remote sourceusing a coaxial cable, fiber optic cable, twisted pair, digitalsubscriber line (DSL), or wireless technologies such as infrared, radio,and microwave, then the coaxial cable, fiber optic cable, twisted pair,DSL, or wireless technologies such as infrared, radio, and microwave areincluded in the definition of medium. Disk and disc, as used herein,include compact disc (CD), laser disc, optical disc, digital versatiledisc (DVD), floppy disk and Blu-ray disc where disks usually reproducedata magnetically, while discs reproduce data optically with lasers.Combinations of the above are also included within the scope ofcomputer-readable media.

It should be noted that the techniques described herein may be used forvarious wireless communication networks such as CDMA, TDMA, FDMA, OFDMA,SC-FDMA, and other systems. The terms “system” and “network” are oftenused interchangeably. A CDMA system may implement a radio technologysuch as CDMA2000, Universal Terrestrial Radio Access (UTRA), etc.CDMA2000 covers IS-2000, IS-95, and IS-856 standards. IS-2000 Releases 0and A are commonly referred to as CDMA2000 1×, 1×, etc. IS-856 (TIA-856)is commonly referred to as CDMA2000 1×EV-DO, High Rate Packet Data(HRPD), etc. UTRA includes Wideband CDMA (WCDMA) and other variants ofCDMA. A TDMA system may implement a radio technology such as GlobalSystem for Mobile Communications (GSM). An OFDMA system may implement aradio technology such as Ultra Mobile Broadband (UMB), Evolved UTRA(E-UTRA), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20,Flash-OFDM™, etc. UTRA and E-UTRA are part of Universal MobileTelecommunication System (UMTS). 3GPP Long Term Evolution (LTE) andLTE-Advanced (LTE-A) are new releases of UMTS that use E-UTRA. UTRA,E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from anorganization named “3rd Generation Partnership Project” (3GPP). CDMA2000and UMB are described in documents from an organization named “3rdGeneration Partnership Project 2” (3GPP2). The techniques describedherein may be used for the systems and radio technologies mentionedabove as well as other systems and radio technologies, includingcellular (e.g., LTE) communications over a shared radio frequencyspectrum band. The description below, however, describes an LTE/LTE-Asystem for purposes of example, and LTE terminology is used in much ofthe description below, although the techniques are applicable beyondLTE/LTE-A applications (e.g., to 5G networks or other next generationcommunication systems).

The previous description of the disclosure is provided to enable aperson skilled in the art to make or use the disclosure. Variousmodifications to the disclosure will be readily apparent to thoseskilled in the art, and the common principles defined herein may beapplied to other variations without departing from the spirit or scopeof the disclosure. Furthermore, although elements of the describedaspects and/or embodiments may be described or claimed in the singular,the plural is contemplated unless limitation to the singular isexplicitly stated. Additionally, all or a portion of any aspect and/orembodiment may be utilized with all or a portion of any other aspectand/or embodiment, unless stated otherwise. Thus, the disclosure is notto be limited to the examples and designs described herein but is to beaccorded the widest scope consistent with the principles and novelfeatures disclosed herein.

What is claimed is:
 1. A method for channel polarization with ratematching in wireless communications, comprising: determining a number ofpunctured bits for block puncturing polar codes; adjusting allocation ofinformation bits based on the number of punctured bits; and generating acodeword for transmission over a wireless channel based on theallocation of the information bits.
 2. The method of claim 1, whereinadjusting allocation of the information bits based on the number ofpunctured bits comprises: freezing input bits corresponding tountransmitted coded bits.
 3. The method of claim 1, wherein adjustingallocation of the information bits based on the number of punctured bitscomprises: freezing additional bits for puncturing with informationbits.
 4. The method of claim 1, wherein adjusting allocation of theinformation bits based on the number of punctured bits comprises:applying block puncturing to an upper part of a coded bits for low ratepolar codes.
 5. The method of claim 1, wherein adjusting allocation ofthe information bits based on the number of punctured bits comprises:determining whether any punctured bits are in a sector of a plurality ofsectors of a channel; and allocating the information bits in the sectorif the punctured bits are absent from the sector.
 6. The method of claim1, wherein adjusting allocation of the information bits based on thenumber of punctured bits comprises: determining whether any puncturedbits are in a sector of a plurality of sectors of sectors of a channel;and allocating one or more frozen bits in the sector if the puncturedbits are present in the sector.
 7. The method of claim 1, furthercomprising: selecting a position for one or more frozen bits using theGaussian approximation.
 8. The method of claim 7, wherein the positionfor the one or more frozen bits is selected such that a firstsub-channel portion is set for the one or more frozen bits and a secondsub-channel portion is sorted based on ascending reliability.
 9. Themethod of claim 1, wherein an M coded bits can be obtained by usinghybrid repetition and puncturing.
 10. The method of claim 1, furthercomprising: utilizing block puncturing without information setoptimization to obtain a number of coded bits for the codeword.
 11. Anapparatus for channel polarization with rate matching in wirelesscommunications, comprising: a memory configured to store instructions; aprocessor communicatively coupled with the memory, the processorconfigured to execute the instructions to: determine a number ofpunctured bits for block puncturing polar codes; adjust allocation ofinformation bits based on the number of punctured bits; and generate acodeword for transmission over a wireless channel based on theallocation of the information bits.
 12. The apparatus of claim 11,wherein the instructions to adjust allocation of the information bitsbased on the number of punctured bits are further configured to: freezeinput bits corresponding to untransmitted coded bits.
 13. The apparatusof claim 11, wherein the instructions to adjust allocation of theinformation bits based on the number of punctured bits are furtherconfigured to: freeze additional bits for puncturing with informationbits.
 14. The apparatus of claim 11, wherein the instructions to adjustallocation of the information bits based on the number of punctured bitsfurther comprise instructions executable by the processor to: applyblock puncturing to an upper part of a coded bits for low rate polarcodes.
 15. The apparatus of claim 11, wherein the instructions to adjustallocation of the information bits based on the number of punctured bitsfurther comprise instructions executable by the processor to: determinewhether any punctured bits are in a sector of a plurality of sectors ofa channel; and allocate the information bits in the sector if thepunctured bits are absent from the sector.
 16. The apparatus of claim11, wherein the instructions to adjust allocation of the informationbits based on the number of punctured bits further comprise instructionsexecutable by the processor to: determine whether any punctured bits arein a sector of a plurality of sectors of sectors of a channel; andallocate one or more frozen bits in the sector if the punctured bits arepresent in the sector.
 17. The apparatus of claim 11, further comprisinginstructions executable by the processor to: select a position for oneor more frozen bits using the Gaussian approximation.
 18. The apparatusof claim 17, wherein the position for the one or more frozen bits isselected such that a first sub-channel portion is set for the one ormore frozen bits and a second sub-channel portion is sorted based onascending reliability.
 19. The apparatus of claim 11, wherein an M codedbits can be obtained by using hybrid repetition and puncturing.
 20. Theapparatus of claim 11, further comprising instructions executable by theprocessor to: utilize block puncturing without information setoptimization to obtain a number of coded bits for the codeword.
 21. Acomputer readable medium storing computer-executable instructionsexecutable by a processor for channel polarization with rate matching inwireless communications, comprising instructions executable for:determining a number of punctured bits for block puncturing polar codes;adjusting allocation of information bits based on the number ofpunctured bits; and generating a codeword for transmission over awireless channel based on the allocation of the information bits. 22.The computer readable medium of claim 21, wherein the instructions foradjusting allocation of the information bits based on the number ofpunctured bits further comprises instructions for: applying blockpuncturing to an upper part of a coded bits for low rate polar codes.23. The computer readable medium of claim 21, wherein the instructionsfor adjusting allocation of the information bits based on the number ofpunctured bits further comprise instructions for: determining whetherany punctured bits are in a sector of a plurality of sectors of achannel; and allocating the information bits in the sector if thepunctured bits are absent from the sector.
 24. The computer readablemedium of claim 21, wherein the instructions for adjusting allocation ofthe information bits based on the number of punctured bits furthercomprise instructions for: determining whether any punctured bits are ina sector of a plurality of sectors of sectors of a channel; andallocating one or more frozen bits in the sector if the punctured bitsare present in the sector.
 25. The computer readable medium of claim 21,further comprising instructions for: selecting a position for one ormore frozen bits using the Gaussian approximation.
 26. The computerreadable medium of claim 21, wherein the position for the one or morefrozen bits is selected such that a first sub-channel portion is set forthe one or more frozen bits and a second sub-channel portion is sortedbased on ascending reliability.
 27. The computer readable medium ofclaim 21, wherein an M coded bits can be obtained by using hybridrepetition and puncturing.
 28. The computer readable medium of claim 17,further comprising instructions for: utilizing block puncturing withoutinformation set optimization to obtain a number of coded bits for thecodeword.
 29. An apparatus for rate matching codes polarization ofwireless communications, comprising: means for determining a number ofpunctured bits for block puncturing polar codes; means for adjustingallocation of information bits based on the number of punctured bits;and means for generating a codeword for transmission over a wirelesschannel based on the allocation of the information bits.
 30. Theapparatus of claim 29, wherein the means for adjusting allocation of theinformation bits based on the number of punctured bits comprises: meansfor applying block puncturing to an upper part of a coded bits for lowrate polar codes.